package com.zjj.algorithm.learning.leetcode.matrix;

import java.util.List;

/**
 * 212. 单词搜索 II 中档题
 * <p>
 * 给定一个 m x n 二维字符网格 board 和一个单词（字符串）列表 words， 返回所有二维网格上的单词 。
 * <p>
 * 单词必须按照字母顺序，通过 相邻的单元格 内的字母构成，其中“相邻”单元格是那些水平相邻或垂直相邻的单元格。同一个单元格内的字母在一个单词中不允许被重复使用。
 * <p>
 * <p>
 * 输入：board = [
 * ["o","a","a","n"],
 * ["e","t","a","e"],
 * ["i","h","k","r"],
 * ["i","f","l","v"]
 * ],
 * words = ["oath","pea","eat","rain"]
 * <p>
 * 输出：["eat","oath"]
 * <p>
 * 输入：board = [
 * ["a","b"],
 * ["c","d"]
 * ],
 * words = ["abcb"]
 * 输出：[]
 *
 * @author zjj_admin
 * @date 2022/12/20 17:03
 */
public class WordSearch2 {

    public static void main(String[] args) {

    }


    public static List<String> findWords(char[][] board, String[] words) {
        return null;
    }
}
